Optimal Portfolio Selection with Genetic Algorithm: An Example of BIST-30
نویسندگان
چکیده
منابع مشابه
Selection of an Optimal Hybrid Water/Gas Injection Scenario for Maximization of Oil Recovery Using Genetic Algorithm
Production strategy from a hydrocarbon reservoir plays an important role in optimal field development in the sense of maximizing oil recovery and economic profits. To this end, self-adapting optimization algorithms are necessary due to the great number of variables and the excessive time required for exhaustive simulation runs. Thus, this paper utilizes genetic algorithm (GA), and the objective...
متن کاملOptimal Smooth Portfolio Selection for An Insider
Abstract We study the optimal portfolio problem for an insider, in the case that the performance is measured in terms of the logarithm of the terminal wealth minus a term measuring the roughness and the growth of the portfolio. We give explicit solutions in some cases. Our method uses Malliavin calculus and stochastic calculus of forward integrals. We obtain new results about the enlargement of...
متن کاملOPTIMAL SELECTION OF NUMBER OF RAINFALL GAUGING STATIONS BY KRIGING AND GENETIC ALGORITHM METHODS
In this study, optimum combinations of available rainfall gauging stations are selected by a model which is consist of geo statistics model as an estimator and an optimized model. At the first, watershed is approximated to several regular geometric shapes. Then kriging calculates the variance &nbs...
متن کاملUsing Genetic Algorithm in Solving Stochastic Programming for Multi-Objective Portfolio Selection in Tehran Stock Exchange
Investor decision making has always been affected by two factors: risk and returns. Considering risk, the investor expects an acceptable return on the investment decision horizon. Accordingly, defining goals and constraints for each investor can have unique prioritization. This paper develops several approaches to multi criteria portfolio optimization. The maximization of stock returns, the pow...
متن کامل‘ ‘ An Optimal Selection Algorithm ’ ’
We give an optimal parallel algorithm for selection on the EREW PRAM. It requires a linear number of operations and O( log n log∗ n) time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Business Research - Turk
سال: 2015
ISSN: 1309-0712
DOI: 10.20491/isader.2015115764